منابع مشابه
Mating constraint languages for assembly sequence planning
This paper describes and analy es the most commonly used form of constraint languages for assembly planning: mating constraint languages. These constraints are typically composed of relations asserting that a certain pair of parts must be mated before some other pair of parts may be mated. However there are many significant differences between the forms of these constraints used b y different a...
متن کاملConstraint-based interactive assembly planning
Constraints on assembly plans vary depending on product, assembly facility, assembly volume, and many other factors. This paper describes the principles and implementation of a framework that supports a wide variety of user-speci ed constraints for interactive assembly planning. Constraints from many sources can be expressed on a sequencing level, specifying orders and conditions on part mating...
متن کاملA Novel Constraint Model for Parallel Planning
A parallel plan is a sequence of sets of actions such that any ordering of actions in the sets gives a traditional sequential plan. Parallel planning was popularized by the Graphplan algorithm and it is one of the key components of successful SAT-based planers. SAT-based planners have recently begun to exploit multi-valued state variables – an area which seems traditionally more suited for cons...
متن کاملA Model for Constraint-Based Camera Planning
Automatically planning camera shots in virtual 3D environments requires solving problems similar to those faced by human cinematographers. In the most essential terms, each shot must communicate some specified visual message or goal. Consequently, the camera must be carefully staged to clearly view the relevant subject(s), properly emphasize the important elements in the shot, and compose an en...
متن کاملSymmetiy Constraint Inference in Assembly Planning: Automatic Assembly Configuration Specification
In this paper we shall discuss how to treat the automatic generation of assembly task specifications as a constraint satisfaction problem (CSP) over finite and infinite domains. Conceptually it is straightforward to formulate assembly planning in terms of CSP, however the choice of constraint representation and of the order in which the constraints are applied is nontrivial if a computationally...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Manufacturing Systems
سال: 2020
ISSN: 0278-6125
DOI: 10.1016/j.jmsy.2019.11.007